VLSI Architecture for the Low-Computation Cycle and Power-Efficient Recursive DFT/IDFT Design

نویسندگان

  • Lan-Da Van
  • Chin-Teng Lin
  • Yuan-Chu Yu
چکیده

In this paper, we propose one low-computation cycle and power-efficient recursive discrete Fourier transform (DFT)/inverse DFT (IDFT) architecture adopting a hybrid of input strength reduction, the Chebyshev polynomial, and register-splitting schemes. Comparing with the existing recursive DFT/IDFT architectures, the proposed recursive architecture achieves a reduction in computation-cycle by half. Appling this novel low-computation cycle architecture, we could double the throughput rate and the channel density without increasing the operating frequency for the dual tone multi-frequency (DTMF) detector in the high channel density voice over packet (VoP) application. From the chip implementation results, the proposed architecture is capable of processing over 128 channels and each channel consumes 9.77 μW under 1.2 V@20 MHz in TSMC 0.13 1P8M CMOS process. The proposed VLSI implementation shows the power-efficient advantage by the low-computation cycle architecture. key words: channel density, high density voice over packet, high throughput, low-computation cycle, power efficiency, recursive DFT/IDFT

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low-Power and Optimized VLSI Implementation of Compact Recursive Discrete Fourier Transform (RDFT) Processor for the Computations of DFT and Inverse Modified Cosine Transform (IMDCT) in a Digital Radio Mondiale (DRM) and DRM+ Receiver

This paper presents a compact structure of recursive discrete Fourier transform (RDFT) with prime factor (PF) and common factor (CF) algorithms to calculate variable-length DFT coefficients. Low-power optimizations in VLSI implementation are applied to the proposed RDFT design. In the algorithm, for 256-point DFT computation, the results show that the proposed method greatly reduces the number ...

متن کامل

A DHT-based FFT/IFFT processor for VDSL transceivers

This paper presents a new VLSI architecture for computing the Npoint discrete Fourier transform (DFT) of real data and the corresponding inverse (IDFT) based on the discrete Hartley transform, where N is a power of two. The architecture includes two real multipliers, three real adders, six memory-based buffers, two ROM’s, and some simple logic circuits, making itself suitable for single-chip im...

متن کامل

A power-scalable variable-length analogue DFT processor for multi-standard wireless transceivers

Since the invention of the mobile phone, a new generation of mobile communication standard has emerged every 10 years. Upgrading the technology of mobile networks in all areas takes few years. Hence, mobile phones should support the previous communication standards as well as the latest standards. Realizing a multi-standard mobile phone by multiple transceivers in parallel is neither a size-eff...

متن کامل

FPGA Implementation of Low Power Recursive DFT for DTMF Application

The discrete Fourier transform(DFT) has been widely applied in the field of signal processing. There are lots of architectures available in literature which are of computing N point DFT type. Such algorithms are called as FFT computation algorithms. However in some applications we need to computer the DFT for some of selected output bin indices only. One of such example is signal monitoring and...

متن کامل

A VLSI array architecture for realization of DFT, DHT, DCT and DST

An unified array architecture is described for computation of DFT, DHT, DCT and DST using a modified CORDIC (CoOrdinate Rotation DIgital Computer) arithmetic unit as the basic Processing Element (PE). All these four transforms can be computed by simple rearrangement of input samples. Compared to five other existing architectures, this one has the advantage in speed in terms of latency and throu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEICE Transactions

دوره 90-A  شماره 

صفحات  -

تاریخ انتشار 2007